Location:
Search - huffman in java
Search list
Description: 数据结构的java实现-Data Structure written in Java for Huffman Coding Algorithm.
Platform: |
Size: 3072 |
Author: 肖晖 |
Hits:
Description: 用java实心的哈夫曼编码 可以对文件进行无损压缩的新方法-with solid Huffman coding can document the new lossless compression method
Platform: |
Size: 1024 |
Author: zy |
Hits:
Description: 数据结构综合实验,有各种排序算法和计算排序时间,最短路径算法,huffman编码解码.用图形界面实现.在jbuilder2006下运行通过.-comprehensive experimental data structure, various sorting algorithm and sorting time, the shortest path algorithm, Huffman encoding and decoding. Using a graphical interface to achieve. In jbuilder2006 running through.
Platform: |
Size: 220160 |
Author: 陈为 |
Hits:
Description: HUFFMAN和HEAP的JAVA实现。
用来实现文件压缩的基本部分。-HUFFMAN HEAP and JAVA. Documents used to achieve a fundamental part of compression.
Platform: |
Size: 9216 |
Author: 姚维 |
Hits:
Description: 用JAVA写的对文件进行压缩的Huffman编码-with JAVA written document to the Huffman compression coding
Platform: |
Size: 3072 |
Author: 呜呜呜 |
Hits:
Description: 自适应的哈夫曼编码程序，包括屏幕输出和文件保存。-Adaptive Huffman Coding procedures, including the screen output and save the file.
Platform: |
Size: 5120 |
Author: 陈文杰 |
Hits:
Description: 利用霍夫曼树实现文本压缩。如果是文本可以压缩到40％的大小，其他的不行。-Huffman tree to achieve the use of text compression. If the text can be compressed to 40 of the size, the other not.
Platform: |
Size: 29696 |
Author: 肖超伟 |
Hits:
Description: 用java编写的压缩程序，界面美观，算法为霍夫曼编码思想，数据结构课程设计时编写，请大家指点。-Prepared by compression using java program, interface aesthetics, the algorithm for the Huffman code of thought, data structure courses designed to prepare, please advice.
Platform: |
Size: 424960 |
Author: 陈端金 |
Hits:
Description: 如 题， 哈夫曼函数的java代码，网上找到的，在此和大家分享。-Such as title, Huffman function java code, on-line found in this and share with you all.
Platform: |
Size: 2557952 |
Author: haha |
Hits:
Description: 输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Enter a period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal.
Platform: |
Size: 2048 |
Author: alic |
Hits:
Description: /**
* 显示输入提示压缩或解压缩 继承了InputStream类，装有输入流。
*/
public class HZIPInputStream extends InputStream
{
/**
* HZIPInputStream 类的构造函数，定义了huffman树，输入流。
*
* @param in 输入流。
* @throws IOException：如果发生I/O错误则抛出异常。
*/-/*** Show input prompts compression or decompression InputStream inherited categories, with input streams.*/public class HZIPInputStream extends InputStream (/*** HZIPInputStream class constructor, the definition of a huffman tree, enter the stream.** @ Param in input stream.* @ Throws IOException: if there is I/O error is thrown.* /
Platform: |
Size: 75776 |
Author: stone |
Hits:
Description: 该软件支持jpg，gif、png图片格式，大致有下列功能：
V 0.1 版：
1. 图像放大、缩小、复制、打印、获取当前图像任意位置颜色信息。
2. 显示图像灰度直方图。
3. 灰度统计：图像宽度、高度、最小灰度、最大灰度、灰度均值 Mean、灰度方差 Variance、标准差、偏态 Skewness、峰度系数 Kurtosis、熵 (Entropy)。
4. RGB三原色分离、RGB图转灰度图、灰度均衡、图像可调阈值二值化、图像反色。
5. 图像可调阈值边缘检测：Robert算子；Prewit算子；Sobel算子；Kirsch算子
6. 图像Huffman编码。
7. 调色板、屏幕捕捉、屏幕取色、屏幕上任意两点距离的测量。
-The software supports jpg, gif, png image format, generally have the following functions: V 0.1 version: 1. The image to enlarge, shrink, copy, print, anywhere access to the current image color information. 2. Histogram display images. 3. Grayscale statistics: image width, height, minimum gray level, the largest gray, gray Mean Mean, gray variance Variance, standard deviation, skewness Skewness, kurtosis coefficient of Kurtosis, entropy (Entropy). 4. RGB RGB Separation, RGB to grayscale map, gray balance, adjustable threshold image binarization, image anti-color. 5. Image adjustable threshold edge detection: Robert operator Prewit operator Sobel operator Kirsch operator 6. Image Huffman coding. 7. Palettes, screen capture, get color screen, the screen distance between any two measurements.
Platform: |
Size: 1034240 |
Author: 郑一一 |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: 用Java实现的求哈夫曼树算法，包括生成哈夫曼树的详细过程。-Using Java in order to realize Huffman tree algorithms, including Huffman tree to generate the detailed process.
Platform: |
Size: 1024 |
Author: 周建勇 |
Hits:
Description: 问题描述]
利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Description of the problem] use Huffman encoding of information and communication can greatly improve the channel utilization, reduce the information transmission time, lower transmission costs. However, this requires the sending end through a coding system for pre-treatment of mass data encoding, will be heard at the receiving end of the data decoding (recovery). For duplex channel (ie, two-way transmission of information can be channel), each client requires a full encoder/decoder system. Test for such information transceiver station to write a Huffman encoder/decoder system.
Platform: |
Size: 15360 |
Author: yangyang |
Hits:
Description: Huffman Algorithm: 用于文字压缩，通信等领域，是算法学习的必学章节-Huffman Algorithm： Being used in compressed area
Platform: |
Size: 1189888 |
Author: 荆江 |
Hits:
Description: 一组指令进行霍夫曼编码，并输出最后的编码结果以及对指令码的长度进行评价。与扩展操作码和等长码进行比较-A set of instructions to carry out Huffman code, and output the final results of the encoding length of the script evaluation. With the expansion of the operation code and compare the code length
Platform: |
Size: 2048 |
Author: 神仙 |
Hits:
Description: this a source code for data compression using Huffman s coding-this is a source code for data compression using Huffman s coding
Platform: |
Size: 28672 |
Author: kratika |
Hits:
Description: this for development of huffman encoding and decoding in java in java swings.-this is for development of huffman encoding and decoding in java in java swings.
Platform: |
Size: 4281344 |
Author: murthy |
Hits:
Description: Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols occur more frequently than others and by shortening the code for that symbol, space can be saved. There are other interesting properties of Huffman codes as well as some gotchas with respect to their use, so the above link is worth reading.
Platform: |
Size: 2048 |
Author: Felippe |
Hits: